NONPREEMPTIVE SCHEDULING OF A FINITE-SOURCE QUEUE WITH TWO CUSTOMER CLASSES
نویسندگان
چکیده
منابع مشابه
A NONPREEMPTIVE PRIORITY MAP/G/l QUEUE WITH TWO CLASSES OF CUSTOMERS
This p p e r considers a nunpreemptive priority queue with two classes of customers. Customers in each priority class arrive to the system according to a Markovian arrival process (MAP). Since the MAP is weakly dense in the class of stationary point processes, it is a fairly general arrival process. The service times of custcomers in ea,ch priority class are independent and identically distribu...
متن کاملDynamic scheduling of a GI/GI/1+GI queue with multiple customer classes
We consider a dynamic control problem for a GI/GI/1 + GI queue with multiclass customers. The customer classes are distinguished by their interarrival time, service time, and abandonment time distributions. There is a cost ck > 0 for every class k ∈ {1,2, . . . ,N} customer that abandons the queue before receiving service. The objective is to minimize average cost by dynamically choosing which ...
متن کاملA Finite Capacity Priority Queue with Discouragement
In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...
متن کاملThe M/G/1 FIFO Queue with Several Customer Classes
In this note we present short derivations of the joint queue length distribution in the M/G/1 queue with several classes of customers and FIFO service discipline.
متن کاملOptimal server scheduling in nonpreemptive finite-population queueing systems
We consider a finite-population queueing system with heterogeneous classes of customers and a single server. For the case of nonpreemptive service, we fully characterize the structure of the server’s optimal service policy that minimizes the total average customer waiting costs. We show that the optimal service policy may never serve some classes of customers. For those classes that are served,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1987
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.30.200